Location:
Search - minimum cut
Search list
Description: 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate.
Platform: |
Size: 55296 |
Author: 中士 |
Hits:
Description: 主要实现图片的打开，并用最大流最小割定理实现图片的切割-Picture open, and the maximum flow minimum cut theorem of pictures cut
Platform: |
Size: 698368 |
Author: tianqing |
Hits:
Description: 一些算法的简单实现，最大流最小割、B树、最大堆、最短路径等-Simple implementation of the algorithm, the maximum flow minimum cut tree B, the maximum heap shortest path
Platform: |
Size: 6144 |
Author: yougong |
Hits:
Description: 求故障树的
1）对偶树；
2）最小割级和最小路集；
3）假定底事件的故障概率已知，求顶事件发生的概率；
4）求底事件的结构重要度、概率重要度和关键重要度。-Seeking Fault Tree 1) dual tree 2) minimum cut level and minimal path sets 3) It is assumed that the end of the event of the failure probability known, find the probability of occurrence of the top event 4) Evaluate the end of the event structure importance, important degree of probability and critical degree.
Platform: |
Size: 57344 |
Author: Haibin Zhang |
Hits:
Description: 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
Platform: |
Size: 15360 |
Author: Sonny |
Hits:
Description: 最大流最小割算法的VC++实现，用于得出网络原点到终点之间的最大流量限制。-The minimum cut VC++ flow of the algorithm is realized that network origin to finish between the peak flow restrictions.
Platform: |
Size: 1033216 |
Author: 刘一 |
Hits:
Description: 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。
-Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
Platform: |
Size: 38912 |
Author: 小马 |
Hits:
Description: 斯坦福机器学习公开课作业求最小割的作业答案，python实现，运行结果已经经过验证-Stanford Machine Learning Homework for the minimum cut open job answer, python implementation, the results have been proven
Platform: |
Size: 7168 |
Author: caozhankui |
Hits:
Description: 最大流最小截问题，用ｍａｔｌａｂ编写的，ｒａｒ中有说明，较清晰-Maximum flow minimum cut problem, using matlab prepared, rar have stated more clearly
Platform: |
Size: 216064 |
Author: llmmpe |
Hits:
Description: 全局立体匹配一直是一个比较困难的问题，本算法通过C++编译器，实现了全局立体匹配算法，希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching.
Platform: |
Size: 6223872 |
Author: gongwenbiao |
Hits:
Description: 这是一种图割算法的实现，包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
Platform: |
Size: 149504 |
Author: renmeimei |
Hits:
Description: 利用图割方法（最大流最小割）进行相位解缠-Use graph cut method (maximum flow minimum cut) for phase unwrapping
Platform: |
Size: 352256 |
Author: 应红立 |
Hits:
Description: 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard
Platform: |
Size: 396288 |
Author: renmeimei |
Hits:
Description: 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
Platform: |
Size: 620544 |
Author: caidb |
Hits:
Description: 由最大流最小割算法，求图的最大流。基于论文
“An Experimental Comparison of Min-Cut/Max-Flow Algorithms”-The maximum flow minimum cut algorithm, seeking maximum flow chart. Paper-based
An Experimental Comparison of Min-Cut/Max-Flow Algorithms
Platform: |
Size: 30720 |
Author: 金静 |
Hits:
Description: 使用最小割最大流实现图割的立体匹配算法，建立匹配能量函数，构造网格图并求得最小值，匹配效率高时间短，内附说明文档及分析用法。
-The use of the maximum flow minimum cut graph cut algorithm for stereo matching, matching of energy function, and obtain the minimum mesh structure, high efficiency, short time, containing documentation and analysis.
Platform: |
Size: 7521280 |
Author: helloC |
Hits:
Description: 一个新的求图的最小割的方法，Stoer-Wagner能够求得最佳分割方式，而且其速度很快。
-A new method for the minimum cut of the graph, Stoer-Wagner is able to get the best segmentation method, and its speed is very fast.
Platform: |
Size: 3072 |
Author: 三度空间 |
Hits:
Description: 求无向连通图的最小割点。用R.Tarjan发明的算法来实现的。该算法能够求出无向连通图中最小割点。-Seeking connected undirected graph minimum cut point. Algorithmically R.Tarjan invention to achieve. The algorithm can be obtained connected undirected graph minimum cut points.
Platform: |
Size: 1024 |
Author: 相知无悔 |
Hits:
Description: 最大流分割程序，利用最大流最小割定理进行图像分割的matlab源码-Maximum flow segmentation program, using the maximum flow minimum cut theorem for image segmentation matlab source
Platform: |
Size: 138240 |
Author: 叶子童 |
Hits:
Description: 在计算机视觉中的立体匹配算法 最大流最小割,最新的研究成果-In a stereo matching algorithm in computer vision, maximum flow minimum cut, the latest research results,,
Platform: |
Size: 414720 |
Author: cospanison |
Hits: